P systems with minimal parallelism

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P systems with minimal parallelism

A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. We contribute in this paper to this issue by considering the minimal parallelism of using the rules: if at least a rule from a set of rules associated with a membrane or a regi...

متن کامل

P systems with minimal insertion and deletion

1 IEC, Department of Information Engineering, Graduate School of Engineering Hiroshima University, Higashi-Hiroshima 739-8527 Japan 2 Research Group on Mathematical Linguistics, Rovira i Virgili University Av. Catalunya, 35, Tarragona 43002 Spain [email protected] 3 Institute of Mathematics and Computer Science, Academy of Sciences of Moldova Academiei 5, Chişinău MD-20...

متن کامل

A Modeling Approach Based on P Systems with Bounded Parallelism

This paper presents a general framework for modelling with membrane systems that is based on a computational paradigm where rules have associated a finite set of attributes and a corresponding function. Attributes and functions are meant to provide those extra features that allow to define different strategies to run a P system. Such a strategy relying on a bounded parallelism is presented usin...

متن کامل

Flat maximal parallelism in tissue P systems with promoters

Tissue P systems with promoters are distributed parallel computing models inspired by the structure of tissues and the way of communicating substances regulated by promoters. In this work, we consider tissue P systems with promoters working in a flat maximally parallel way, where in each step, in each membrane, a maximal set of applicable rules is chosen and each rule in the set is applied exac...

متن کامل

Minimal Cooperation in Symport/Antiport P Systems with One Membrane

In this paper we consider symport/antiport P systems with one membrane and rules having at most two objects. Although it has been proved that only finite number sets can be generated by both OP1(sym2) (one-membrane systems with symport rules of weight at most 2) and OP1(sym1, anti1) (one-membrane systems with symport/antiport rules of weight 1), the exact characterization is still an open quest...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2007.03.044